Derived linear systems of context-free grammars

Transforming Linear Context-Free Rewriting Systems into Minimalist Grammars

Transforming Linear Context-Free Rewriting Systems into Minimalist Grammars

The type of a minimalist grammar (MG) as introduced by Stabler [11, 12] provides an attempt of a rigorous algebraic formalization of the new perspectives adopted within the linguistic framework of transformational grammar due to the change from GB–theory to minimalism. Michaelis [6] has shown that MGs constitute a subclass of mildly context–sensitive grammars in the sense that for each MG there...

Factorization of Synchronous Context-Free Grammars in Linear Time

Factoring a Synchronous Context-Free Grammar into an equivalent grammar with a smaller number of nonterminals in each rule enables synchronous parsing algorithms of lower complexity. The problem can be formalized as searching for the tree-decomposition of a given permutation with the minimal branching factor. In this paper, by modifying the algorithm of Uno and Yagiura (2000) for the closely re...

Modularized Context-Free Grammars

Given two context-free grammars (CFGs), G 1 and G 2 , the language generated by the union of the grammars is not the union of the languages generated by each grammar: L(G 1 G 2) 6 = L(G 1) L(G 2). In order to account for mod-ularity of grammars, another way of deening the meaning of grammars is needed. This paper adapts results from the semantics of logic programming languages to CFGs. We discu...

Multiple Context-Free Grammars

Multiple context-free grammar (MCFG) is a weakly contextsensitive grammar formalism that deals with tuples of strings. An MCFG is called m-MCFG if all tuples have at most m components. In this summary I will outline that the expressivity of m-MCFG’s increases with the parameter m and that the class of tree-adjoining languages is properly included in the class of 2-multiple context-free language...